Generating Random and Pseudorandom Sequences in Mobile Devices

نویسندگان

  • Jan Krhovjak
  • Vashek Matyas
  • Jiri Zizkovsky
چکیده

In our paper we study practical aspects of random and pseudorandom number generation in mobile environments. We examine and analyze several sources of randomness available in current mobile phones and other mobile devices at the application level. We identify good physical sources of randomness that are capable of generating data with high entropy in reasonable time and we investigate some relevant aspects (such as security, energy requirements, performance) of integrating selected pseudorandom number generators in the Symbian OS environment. The main contribution of this paper is the identification and analysis of randomness sources in mobile devices and a practical proposal for their post-processing, including a prototype implementation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cryptographic random and pseudorandom data generators

This dissertation thesis deals with cryptographic random and pseudorandom data generators in mobile computing environments (such as mobile phones, personal digital assistants, cryptographic smartcards). These mobile devices are typically bounded by the amount of energy, performance, memory or even silicon area. This lack of resources leads to very limited computing environments with: a) limited...

متن کامل

The University of Adelaide Use of the Shrinking Generator in Lightweight Cryptography for RFID

RFID tags have severe constraints in computing power and hence offer particular challenges in the provision of e-Security. Whatever is chosen to provide security in an RFID tag should have low computational overhead. New approaches, differing from the traditional cryptosystems based on RSA, Diffie-Hellman, et al. are required. The use of one time codes is particularly appropriate as they guaran...

متن کامل

An Introduction to Pseudorandom Number Generator

R andom numbers are important in every aspect of cryptography. We are evaluating the basic principles which are essential in the design of uniform random number generators, their most important quality requirements, their theoretical study, and their practical testing. National Institute of Standards and Technology (NIST) statistical test suite is the best test suite provided to test the accura...

متن کامل

A Pollard-like pseudorandom number generator over EC

In this short paper we propose a pseudorandom number generator over EC based on Pollardlike method. In contrast to the well known Elliptic Curve Random Number Generator (see e.g. ANSI and NIST draft standards) the generator is based on a random walk over the group of EC-points like in the original Pollard’s rho algorithm and only resembles a little bit the linear congruential generator over ell...

متن کامل

Pseudorandom number generator based on the Bernoulli map on cubic algebraic integers

Abstract We develop a method for generating pseudorandom binary sequences using the Bernoulli map on cubic algebraic integers. The distinguishing characteristic of our generator is that it generates chaotic true orbits of the Bernoulli map by exact computation. In particular, we clarify a way to properly prepare a set of initial points (i.e., seeds), which is needed when generating multiple pse...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009